package hihocoder;
import java.util.Scanner;

/**
 * 
 */

/**
 * @author zhongfang
 *
 */
public class 最大子矩阵 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner scanner=new Scanner(System.in);
		int N=scanner.nextInt();
		int M=scanner.nextInt();
		long K=scanner.nextInt();
		int[][] A=new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j]=scanner.nextInt();
			}
		}
		
		for (int p = 1; p < N; p++) {//p个行数
			for (int q = 0; q < M; q++) {//q个列数
				for (int i = 0; i < N; i++) {
					for (int j = 0; j < M; j++) {
						
					}
				}
			}
		}
	}

}
